Complexity of multi-head finite automata: Origins and directions
نویسندگان
چکیده
منابع مشابه
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
Multi-head finite automata were introduced in [36] and [38]. Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed. Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-se...
متن کاملSize of Unary One-Way Multi-head Finite Automata
One of the main topics of descriptional complexity is the question of how the size of the description of a formal language varies when being described by different formalisms. A fundamental result is the exponential trade-off between the number of states of nondeterministic (NFA) and deterministic finite automata (DFA) (see, for example, [12]). Additional exponential and double-exponential trad...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملMulti-Head Finite Automata: Data-Independent Versus Data-Dependent Computations
We develop a framework on multi-head nite automata that allows us to study the relation of parallel logarithmic time and sequential logarithmic space in a uniform and nonuniform setting in more detail. In both settings it turns out that NC 1 requires data-independent computations|the movement of the input-heads only depends on the length of the input|whereas logarithmic space is caught with dat...
متن کاملComplexity and Universality of Iterated Finite Automata
Iterated Finite Automaton (IFA) is invented by Wolfram for studying the conventional Finite State Automata(FSA) by means of A New Kind of Science (NKS) methodology. An IFA is a composition of a finite state automaton and a tape with limited cells. The complexity of behaviors generated by various FSA operating on different tapes can be visualized by two dimensional patterns. Through enumerating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.024